Tailored Key Encryption (TaKE) Tailoring a key for a given pair of plaintext/ciphertext

نویسنده

  • Gideon Samid
چکیده

Nominally the cryptographic process is defined as follows: Given a plaintext, M, find an encryption algorithm E and an associate key K, so that M can be transformed into ciphertext C. Where the object of the transformation is to insure that without knowledge of K (or a corresponding decryption key K'), it would be practically impossible to reverse the transformation. E and K such that C=E(M,K). Such E will be called Tailored Key Encryption (TaKE) since it is an encryption algorithm which makes it possible to tailor a key K for an (M,C) pair. We explore the following questions: < Is Tailored Key Cryptography of any interest? < Does it exist? < Can a useful instant be found?

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Public-key Encryption with Masking Public-key Encryption with Masking

Timed-release encryption, first mentioned by May [12] and discussed by Rivest, Shamir, and Wanger [15], is a cryptographic primitive which enables us to “send a message into the future.” We take a simple approach, called public-key encryption with masking, in order to realize this requirement. In our model, the sender first encrypts a plaintext and “masks” the ciphertext, then send it the recei...

متن کامل

A New Functional Encryption for Multidimensional Range Query

Functional encryption, which emerges in the community recently, is a generalized concept of traditional encryption (e.g. RSA and AES). In traditional encryption scheme, decrypting a ciphertext with a correct decryption key will output the original plaintext associated to the ciphertext. In contrast, in functional encryption scheme, decrypting a ciphertext with a correct decryption key will outp...

متن کامل

A known-plaintext heuristic attack on the Fourier plane encryption algorithm.

The Fourier plane encryption algorithm is subjected to a known-plaintext attack. The simulated annealing heuristic algorithm is used to estimate the key, using a known plaintext-ciphertext pair, which decrypts the ciphertext with arbitrarily low error. The strength of the algorithm is tested by using this estimated key to decrypt a different ciphertext which was also encrypted using the same or...

متن کامل

Breaking a chaotic image encryption algorithm based on perceptron model

Recently, a chaotic image encryption algorithm based on perceptron model was proposed. The present paper analyzes security of the algorithm and finds that the equivalent secret key can be reconstructed with only one pair of known-plaintext/ciphertext, which is supported by both mathematical proof and experiment results. In addition, some other security defects are also reported.

متن کامل

A Quantum-Classical Scheme towards Quantum Functional Encryption

Quantum encryption is a well studied problem for both classical and quantum information. However, little is known about quantum encryption schemes which enable the user, under different keys, to learn different functions of the plaintext, given the ciphertext. In this paper, we give a novel one-bit secret-key quantum encryption scheme, a classical extension of which allows different key holders...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2000  شماره 

صفحات  -

تاریخ انتشار 2000